[LeetCode 57] Insert Interval 插入区间

“The Linux philosophy is “Laugh in the face of danger”.Oops.Wrong One. “Do it yourself”. Yes, that”s it.”
Linux的哲学就是“在危险面前放声大笑”，呵呵，不是这句，应该是“一切靠自己，自力更生”才对。

/**
 * 给出一个无重叠的 ，按照区间起始端点排序的区间列表。
 * 在列表中插入一个新的区间，你需要确保列表中的区间仍然有序且不重叠（如果有必要的话，可以合并区间）。
 *
 * copy 56，把要加入的区间放到集合中合并
 */

public class leetcode57 {

    public class Interval {
        int start;
        int end;

        Interval () {
            start = 0;
            end = 0;
        }

        Interval (int s, int e) {
            start = s;
            end = e;
        }
    }

    public List<Interval> insert (List<Interval> intervals, Interval newInterval) {
        intervals.add(newInterval);
        return merge(intervals);
    }

    public List<Interval> merge (List<Interval> intervals) {
        Collections.sort(intervals, new Comparator<Interval>() {
            @Override
            public int compare (Interval o1, Interval o2) {
                return Integer.compare(o1.start, o2.start);
            }
        });
        List<Interval> res = new ArrayList<>();
        for (int i = 1; i < intervals.size(); i++) {
            Interval left = intervals.get(i - 1);
            Interval right = intervals.get(i);
            Interval mergeInterval = new Interval();
            if (right.start <= left.end) {
                mergeInterval = new Interval(left.start, Math.max(left.end, right.end));
                intervals.set(i, mergeInterval);
            } else
                res.add(intervals.get(i - 1));
        }
        res.add(intervals.get(intervals.size() - 1));
        return res;
    }
}